package dp.test62;

/**
 * @author code_yc
 * @version 1.0
 * @date 2020/7/22 12:24
 */
public class Solution1 {

    public int uniquePaths(int m, int n) {
        if (m <= 1 || n <= 1) return 1;
        int[][] dp = new int[m][n];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (i == 0 || j == 0) dp[i][j] = 1;
                else {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }
            }
        }
        return dp[m - 1][n - 1];
    }
}
